Geometric Construction Codes of Hamming Distance-8
نویسنده
چکیده
A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1]. It generates all the even full information rate (optimal) Hamming distance – 4 codes. In this paper, we have enhanced the construction of GC codes with respect to code rate and derived a code family of hamming distance-8 GC codes.
منابع مشابه
Which linear codes are algebraic-geometric?
An infinite series of curves is constructed in order to show that all linear codes can be obtained from curves using Goppa's construction. If one imposes conditions on the degree of the divisor used, then we derive criteria for linear codes to be algebraic-geometric. In particular, we investigate the family of q-ary Hamming codes, and prove that only those with redundancy one or two, and the bi...
متن کاملAn Efficient Construction of Self-Dual Codes
We complete the building-up construction for self-dual codes by resolving the open cases over GF (q) with q ≡ 3 (mod 4), and over Zpm and Galois rings GR(p, r) with an odd prime p satisfying p ≡ 3 (mod 4) with r odd. We also extend the buildingup construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we ...
متن کاملThe Weight Distribution of a Family of Lagrangian-Grassmannian Codes
Using Plücker coordinates we construct a matrix whose columns parametrize all projective isotropic lines in a symplectic space E of dimension 4 over a finite field Fq. As an application of this construction we explicitly obtain the smallest subfamily of algebro-geometric codes defined by the corresponding Lagrangian-Grassmannian variety. Furthermore, we show that this subfamily is a class of th...
متن کاملEfficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes
A list decoding for an error-correcting code is a decoding algorithm that generates a list of codewords within a Hamming distance from the received vector, where can be greater than the error-correction bound. In [18], a list-decoding procedure for Reed–Solomon codes [19] was generalized to algebraic–geometric codes. A recent work [8] gives improved list decodings for Reed–Solomon codes and alg...
متن کاملOn (Partial) Unit Memory Codes Based on Gabidulin Codes
Partial) Unit Memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so–called sum rank metric. For the sum rank metric, the free rank distance, the extended row ran...
متن کامل